Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel
نویسندگان
چکیده
Program libraries are one way to make the cooperation between specialists from various fields successful: the separation of application-specific knowledge from applicationindependent tasks ensures portability, maintenance, extensibility, and flexibility. This paper demonstrates the success in combining problem-specific knowledge for the quadratic assignment problem (QAP) with the raw computing power offered by contemporary parallel hardware by using the library of parallel search algorithms ZRAM. The solutions of 10 previously unsolved large standard test-instances of the QAP are presented.
منابع مشابه
A New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems
There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملSolving Large-Scale QAP Problems in Parallel with the Search Library ZRAM
Program libraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent tasks ensures portability, maintenance, extensibility, and exibility. The current paper demonstrates the success in combining problem-speci c knowledge for the quadratic assignment problem (QAP) with the raw computin...
متن کاملOn the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel
The quadratic assignment problem (QAP) belongs to the hard core of N P-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not suucient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that prove...
متن کاملParallel Ant Colonies for Combinatorial Optimization Problems
Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is...
متن کامل